Equidistribution Among Cosets of Elliptic Curve Points in Intervals
نویسندگان
چکیده
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملOperations of Points on Elliptic Curve in Projective Coordinates
In this article, we formalize operations of points on an elliptic curve over GF(p). Elliptic curve cryptography [7], whose security is based on a difficulty of discrete logarithm problem of elliptic curves, is important for information security. We prove that the two operations of points: compell ProjCo and addell ProjCo are unary and binary operations of a point over the elliptic curve. The te...
متن کاملSet of Points on Elliptic Curve in Projective Coordinates
For simplicity, we use the following convention: x is a set, i, j are integers, n, n1, n2 are natural numbers, and K, K1, K2 are fields. Let K be a field. A field is called a subfield of K if it satisfies the conditions (Def. 1). (Def. 1)(i) The carrier of it ⊆ the carrier of K, (ii) the addition of it = (the addition of K) (the carrier of it), (iii) the multiplication of it = (the multiplicati...
متن کاملEquidistribution of Points via Energy
We study the asymptotic equidistribution of points with discrete energy close to Robin’s constant of a compact set in the plane. Our main tools are the energy estimates from potential theory. We also consider the quantitative aspects of this equidistribution. Applications include estimates of growth for the Fekete and Leja polynomials associated with large classes of compact sets, convergence r...
متن کاملCompact Representation of Elliptic Curve Points over F2n
finite fields, elliptic curves, cryptography A method is described to represent points on elliptic curves over F2n‚ in the context of elliptic curve cryptosystems‚ using n bits. The method allows for full recovery of the x and y components of the point. This improves on the naive representation using 2n bits and on a previously known compressed representation using n + 1 bits. Since n bits are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2020
ISSN: 1862-2984,1862-2976
DOI: 10.1515/jmc-2019-0020